Iterated Regret Minimization in Game Graphs

نویسندگان

  • Emmanuel Filiot
  • Tristan Le Gall
  • Jean-François Raskin
چکیده

Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides solutions that are judged more reasonable than solutions offered by traditional game concepts – such as Nash equilibrium –. In this paper, we investigate iterated regret minimization for infinite duration two-player quantitative non-zero sum games played on graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterated Regret Minimization: A More Realistic Solution Concept

For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional game-theoretic solution concepts—and most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. In this paper, we introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many ...

متن کامل

Iterated Regret Minimization: A New Solution Concept

For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional gametheoretic solution concepts—most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. We introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many games of interest, i...

متن کامل

Iterated Regret Minimization in Voting Games

The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compa...

متن کامل

Dynamic Epistemic Characterizations for IERS

The iterated regret minimization solution exhibits the good qualitative behavior as that observed in experiments in many games that have proved problematic for Nash Equilibrium(NE). It is worthy exploring epistemic characterizations unearthing players’rationality for an algorithm of Iterated Eliminations Regret-dominated Strategy (IERS) related to the solution. In this paper, based on the dynam...

متن کامل

A Regret Minimization Approach in Product Portfolio Management with respect to Customers’ Price-sensitivity

In an uncertain and competitive environment, product portfolio management (PPM) becomes more challenging for manufacturers to decide what to make and establish the most beneficial product portfolio. In this paper, a novel approach in PPM is proposed in which the environment uncertainty, competitors’ behavior and customer’s satisfaction are simultaneously considered as the most important criteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010